Log concavity and concentration of Lipschitz functions on the Boolean hypercube
نویسندگان
چکیده
It is well-known that measures whose density the form e ? V where a uniformly convex potential on R n attain strong concentration properties. In search of notion log-concavity discrete hypercube, we consider { 1 , } multi-linear extension f satisfies log ? ? 2 ( x ) ? ? I for ? 0 which refer to as -semi-log-concave. We prove these satisfy nontrivial bound, namely, any Hamming Lipchitz test function ? Var ? [ ] ? C > . As corollary, bound exhibit so-called Rayleigh property. Namely, show such under external field (or exponential tilt), correlation between two coordinates non-positive, Hamming-Lipschitz functions admit concentration.
منابع مشابه
A strong log-concavity property for measures on Boolean algebras
We introduce the antipodal pairs property for probability measures on finite Boolean algebras and prove that conditional versions imply strong forms of log-concavity. We give several applications of this fact, including improvements of some results of Wagner [15]; a new proof of a theorem of Liggett [9] stating that ultra-log-concavity of sequences is preserved by convolutions; and some progres...
متن کاملLog-convexity and log-concavity of hypergeometric-like functions
We find sufficient conditions for log-convexity and log-concavity for the functions of the forms a 7→ ∑ fk(a)kx , a 7→ ∑ fkΓ(a + k)x k and a 7→ ∑ fkx k/(a)k. The most useful examples of such functions are generalized hypergeometric functions. In particular, we generalize the Turán inequality for the confluent hypergeometric function recently proved by Barnard, Gordy and Richards and log-convexi...
متن کاملOn Lipschitz Bijections between Boolean Functions
Given two functions f, g : {0, 1}n → {0, 1} a mapping ψ : {0, 1}n → {0, 1}n is said to be a mapping from f to g if it is a bijection and f(z) = g(ψ(z)) for every z ∈ {0, 1}n. In this paper we study Lipschitz mappings between boolean functions. Our first result gives a construction of a C-Lipschitz mapping from the Majority function to the Dictator function for some universal constant C. On the ...
متن کاملConcentration of non-Lipschitz functions and applications
Strong concentration results play a fundamental role in probabilistic combinatorics and theoretical computer science. In this paper, we present several new concentration results developed recently by the author and collaborators. To illustrate the power of these new results, we discuss applications in many different areas of mathematics, from combinatorial number theory to the theory of random ...
متن کاملA Note on Log-Concavity
This is a small observation concerning scale mixtures and their log-concavity. A function f(x) ≥ 0, x ∈ Rn is called log-concave if f (λx + (1− λ)y) ≥ f(x)f(y) (1) for all x,y ∈ Rn, λ ∈ [0, 1]. Log-concavity is important in applied Bayesian Statistics, since a distribution with a log-concave density is easy to treat with many different approximate inference techniques. For example, log-concavit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2022
ISSN: ['0022-1236', '1096-0783']
DOI: https://doi.org/10.1016/j.jfa.2022.109392